On Multicast Path Finding Algorithms
نویسنده
چکیده
Abstract We have designed and implemented three multicast path finding algorithms for networks with directed links: an optimal algorithm based on the dynamic programming technique, a heuristic algorithm with the assumption that all vertices have the multicast capability, and a heuristic algorithm for networks where some vertices do not have the multicast capability. Computation results show that the heuristic algorithms can find multicast paths whose costs are close to optimal and can operate with reasonable response time for large networks. We discuss applications of these path finding algorithms to set up multipoint connections.
منابع مشابه
Row/Column-First: A Path-based Multicast Algorithm for 2D Mesh-based Network on Chips
In this paper, we propose a new path-based multicast algorithm that is called Row/Column-First algorithm. The proposed algorithm constructs a set of multicast paths to deliver a multicast message to all multicast destination nodes. The set of multicast paths are all of row-first or column-first subcategories to maximize the multicast performance. The selection of row-first or column-first appro...
متن کاملThe Application of K–Shortest Path Algorithm in Multicast Routing
Abstract. There have been many heuristic algorithms finding multicast trees proposed over the past few years. The necessity for finding a better and more suitable algorithm is still a current and important challenge. The article presents a new multicast routing algorithm for finding a multicast tree in packet networks. The objective of the K-Shortest Path Multicast Algorithm (KSPMA) is to minim...
متن کاملOn Minimizing Multicast Completion Delay for Instantly Decodable Network Coding
In this paper, we consider the problem of minimizing the mean completion delay in wireless multicast for instantly decodable network coding. We first formulate the problem as a stochastic shortest path (SSP) problem. Although finding the optimal selection policy using SSP is intractable, we use this formulation to draw the theoretical properties of efficient selection algorithms. Based on these...
متن کاملDistributed delay constrained multicast path setup algorithm for high speed networks
The problem of finding an optimal multicast tree in a point to point network translates to the Steiner Problem in graphs. Since the Steiner problem is NPcomplete, heuristic approaches are required for path setup. The problem takes a new dimension in Wide Area Networks, where centralized algorithms are not feasible , and distributed schemes are needed. It is also desirable that node participatio...
متن کاملProtecting a multicast session against single link failures in a mesh network
In this report, we investigate approaches and algorithms for establishing a multicast session in a mesh network while protecting the session against any single link failure, e.g., a fiber cut in an optical network. We propose two new and efficient approaches for protecting a multicast session: 1) segment protection in which we protect each segment in the primary tree separately (rather than the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991